Distributed computation of virtual coordinates for greedy routing in sensor networks
نویسندگان
چکیده
منابع مشابه
Distributed computation of virtual coordinates for greedy routing in sensor networks
Sensor networks are emerging as a paradigm for future computing, but pose a number of challenges in the fields of networking and distributed computation. One challenge is to devise a greedy routing protocol—one that routes messages through the network using only information available at a node or its neighbors. Modeling the connectivity graph of a sensor network as a 3-connected planar graph, w...
متن کاملAligned Virtual Coordinates for Greedy Geometric Routing in Wireless Sensor Networks
The performance of geographic routing protocols is impacted by physical voids and localization errors. Traversing voids is carried out by a complimentary algorithm, which requires high overhead and results in lower quality paths. Furthermore, localization errors lead to inefficient routes or even misrouting of packets. Accordingly, virtual coordinate systems (VCS) were proposed to be an alterna...
متن کاملa new greedy geographical routing in wireless sensor networks
wireless sensor network includes a large number of nodes which are distributed in a geographical location. the essential fact about wsn is that energy of nodes is limited. therefore, presenting proper solutions as an optimized routing is crucial to equally use energy of all nodes. in this paper we propose a method which performs routing in wsns using greedy approach. it is able to choose optimu...
متن کاملMulticast Routing in Wireless Sensor Networks: A Distributed Reinforcement Learning Approach
Wireless Sensor Networks (WSNs) are consist of independent distributed sensors with storing, processing, sensing and communication capabilities to monitor physical or environmental conditions. There are number of challenges in WSNs because of limitation of battery power, communications, computation and storage space. In the recent years, computational intelligence approaches such as evolutionar...
متن کاملWeak Greedy Routing over Graph Embedding for Wireless Sensor Networks
In this paper we classify the greedy routing in sensor networks into two categories, strong greedy routing and weak greedy routing. Most existing work mainly focuses on weak greedy routing over geographic location network or strong greedy routing over greedy embedding network. It is a difficult job and needs much cost to obtain geographic location or greedy embedding of the network. We propose ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2011
ISSN: 0166-218X
DOI: 10.1016/j.dam.2010.10.016